ORIGINAL RESEARCH A Reduction Algorithm for Computing The Hybridization Number of Two Trees Magnus Bordewich 1, Simone Linz 2,3, Katherine St. John 4 and Charles Semple 2 1

Source URL: community.dur.ac.uk

• Phylogenetics
• Knowledge representation
• Data types
• Phylogenetic network
• Agreement forest
• Tree
• Phylogenetic tree
• Reticulate evolution
• Bioinformatics
• Binary trees

MEGA5: Molecular Evolutionary Genetics Analysis Using Maximum Likelihood, Evolutionary Distance, and Maximum Parsimony Methods Koichiro Tamura,1,2 Daniel Peterson,2 Nicholas Peterson,2 Glen Stecher,2 Masatoshi Nei,3 and

Source URL: www.megasoftware.net

• Computational phylogenetics
• Phylogenetics
• Bioinformatics
• Sequence alignment
• Masatoshi Nei
• Multiple sequence alignment
• Substitution model
• Maximum parsimony
• Molecular clock
• Nucleic acid sequence
• Lineage
• Phylogenetic tree

Genesis 3 Now the serpent was more crafty than any other beast of the field that the Lord God had made. He said to the woman, “Did God actually say, ‘You shall not eat of any tree in the garden’?” 2 And the woman

Source URL: www.cov-pres.org

Approximating Sensor Network Queries Using In-Network Summaries Alexandra Meliou #1 , Carlos Guestrin ∗2 , Joseph M. Hellerstein #3 # EECS Department, UC Berkeley

Source URL: select.cs.cmu.edu

• Computer programming
• Data mining
• Mathematical optimization
• Software engineering
• Cluster analysis
• Geostatistics
• Mathematics
• R-tree
• Dynamic programming
• Tree traversal
• Nearest neighbor search
• Query optimization

Storage Management in AsterixDB Sattam Alsubaiee #1 , Alexander Behm ∗2 , Vinayak Borkar #1 , Zachary Heilbron #1 , Young-Seok Kim #1 , Michael J. Carey #1 , Markus Dreseler +3 , Chen Li #1 # Department of Computer Sc

Source URL: asterix.ics.uci.edu

• Computing
• Data management
• Software
• Log-structured merge-tree
• B-tree
• Databases
• Extensible Storage Engine
• Database index
• B+ tree
• LSm
• Relational database
• Database engine

Motion Planning For Steerable Needles in 3D Environments with Obstacles Using Rapidly-Exploring Random Trees and Backchaining Jijie Xu1 , Vincent Duindam2, Ron Alterovitz1,3 , and Ken Goldberg1,2 1. Department of IEOR, U

Source URL: goldberg.berkeley.edu

• Search algorithms
• Robot kinematics
• Robot navigation
• Robot control
• Rapidly-exploring random tree
• Motion planning
• Kinodynamic planning
• Linear programming
• Nonholonomic system
• Nearest neighbor search

Feedback Control of Real-Time Display Advertising Weinan Zhang1 , Yifei Rong2,1 , Jun Wang1 , Tianchi Zhu3 , Xiaofan Wang4 1 University College London, 2 YOYI Inc., 3 Big Tree Times Co., 4 Shanghai Jiao Tong University 1

Source URL: www0.cs.ucl.ac.uk

Correction for “Pebbles and Branching Programs for Tree Evaluation”, by Stephen Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, and Rahul Santhanam, ACM ToCT (3,2), 2012. January, 2013 Theorem 5.15 in the above p

Source URL: www.cs.utoronto.ca

Tree Pattern Rewriting Systems⋆ B. Genest3 , A. Muscholl1 , O. Serre2 , and M. Zeitoun1 1 LaBRI, Bordeaux; 2 LIAFA, Paris 7 & CNRS; 3 IRISA, Rennes 1 & CNRS

Source URL: www.labri.fr

Decision Trees for Predictive Modeling Padraic G. Neville SAS Institute Inc. 4 August 1999 What a Decision Tree Is . . . . . . . . . . . . . . . . . . .2 What to Do with a Tree . . . . . . . . . . . . . . . . . . . 3 Var

Source URL: datamining.bus.utk.edu